搜索资源列表
A Prime Number Generator
- Threw history,prime numbers has always be a great fascination for mathematicians. Even in modern times,primes numbers continues to fascinate many people.Probably the main reason why prime numbers continues to create such great interest would be becau
PrimeNumbers
- this algorithm is about prime numbers
prime
- 用概率算法实现求素数10000以内的素数的问题，并且与确定性算法比较。-With the probability algorithm for prime numbers less than 10000 prime numbers, and compared with the deterministic algorithm.
prime
- 产生大素数。以时间作为随机数生成的种子，随机生成大素数。-Generate large prime numbers. With time as the random number generator seeds, randomly generated large prime numbers.
prime
- 题目 质数分解与栈的使用 简介 只能被自身和1整除的正整数称为质数。每一个整数都可以写成质数乘积的形式，称为整数的质数分解。例如： 1776 = 37 x 3 x 2 x 2 x 2 x 2. -Title prime number decomposition and the use of stack profile only divisible by themselves and a positive integer is called prime number. Ever
primes
- 该程序用以查找任意两个整数之间的所有素数。 Prime number finder can find all primes between a and b and will write the results to the file PRIMES.TXT-The program used to search any two integers all prime numbers between. Prime number finder can find all primes between a a
prime
- 两种高效求素数的方法，比起一般的方法效率要高-Two kinds of highly efficient method of seeking prime numbers than the general method of the efficiency of higher
EX4
- 用Win32所提供的同步对象解决有限缓冲区问题：写一个过线程实现C/C++语言程序：一些线程负责找出某个范围的素数，并放到一个数组中。另一些线程负责将数组中的素数取出，依次显示 -Use Win32 synchronization objects provided by the limited buffer problem to solve: write a thread to achieve than C/C++ Language Program: responsible for a nu
Find-the-prime-numbers-from-1-to-n
- 求1到n的素数，其中可能又不是很精简的地方，但程序还算快-Find the prime numbers from 1 to n, which may place and not very concise, but fairly quick process
find-prime-numbers-code
- 此代码可以高效的求出所1到1200000的素数，具体的范围可以根据需要修改代码-This code can efficiently find the prime numbers 1-1200000, the specific scope may need to modify code
find-prime-numbers
- 利用C语言实现从3-1000之间找出所有的素数，算法比较简洁-Just use the most simple C language to find all the prime numbers between 3 and 1000
How-many-prime-numbers
- 已知许多整数，求素数个数。先输入N（整数个数），再输入N个整数。每个都不超过32位整型，不小于2.-Give you a lot of positive integers, just to find out how many prime numbers there are.In each case, there is an integer N representing the number of integers to find. Each integer won’t exceed 32-bit
To-determine-the-prime-numbers
- 判断101-200之间有多少个素数，并输出所有素数。-Between 101-200 judge how many prime numbers, and outputs all primes.
Screening-find-prime-numbers
- 除了自身之外，无法被其它整数整除的数称之为质数，要求质数很简单，但如何快速的 求出质数则一直是程式设计人员与数学家努力的课题，在这边介绍一个着名的Eratosthenes求质 数方法。-In addition to outside itself, can not be called an integer divisible by the number of other primes, prime requirement is very simple, but how fast Fi
Detecting-prime-numbers
- Detecting prime numbers with C. numbers between 100-5-Detecting prime numbers with C. numbers between 100-500
Large-prime-numbers-library-RSA
- 大素数库，已经实现了大素数的生成算法，可以直接使用，用于rsa算法-Large prime numbers library
Prime numbers in pthreads
- Find prime numbers in a interval of time by using parallelism with pthreads
Seeking-twin-prime-numbers
- 所谓孪生素数指的是间隔为2的两个相邻素数，因为它们之间的距离已经近的不能再近了，如同孪生兄弟一样，所以将这一对素数称为孪生素数。 显然，最小的一对孪生素数是（1，3）。我们可以写出3〜 100以内的孪生素数，一共有8对，分别是（3，5），（5，7），（11，13），（17，19），（29，31），（41，43），（59，61）和（71，73）。随着数字的增大，孪生素数的分布也越来越稀疏，人工寻找孪生素数变得非常困难。 本题要解决的问题是：编程求出3〜
Prime search
- 素数查找功能的程序，适用于C语言。质数（prime number）又称素数，有无限个。质数定义为在大于1的自然数中，除了1和它本身以外不再有其他因数，这样的数称为质数(The prime search function program is suitable for C language. Prime number, also known as prime number, there are infinite. The prime number is defined as a natural n
prime
- How to find prime numbers